Sustainable and Round-Optimized Group Authenticated Key Exchange in Vehicle Communication
نویسندگان
چکیده
Vehicle authentication is an essential component validating the vehicle’s identity and ensuring integrity of transformed data for intelligent transport vehicles (ITS) in vehicular ad hoc network (VANET). Easy to deploy operate privacy-enhancing vehicle mechanisms are mainstay widespread ITS VANET. Very recently, VANET security architectures constituting by IEEE 1609.2 group, NoW project, SeVeCom project. However, these approaches heavily depend on consuming public key infrastructure (PKI) certification authorities (CA). In this work, walking along research line, we attempt design protocols with two diverse factors Vehicle-to-Vehicle (V2V) Vehicle-to-Infrastructure (V2I) networks, respectively, without depending stumbling block PKI/CA. addition, a smooth projective hash function (SPHF) (a.k.a., special case designated-verifier zero-knowledge proof system) guarantees any recipient can confirm authenticity received messages knowing factors. Thus, optimize communication round, SPHF used (group) two-factor authenticated exchange (AKE) low-interactive rounds. The proof-of-concept implementation indicates that computation overheads introduced our solution acceptable real-world deployments. proposed approach validated using Bellare-Pointcheval-Rogaway (BPR) model experimental evaluation theoretical analysis.
منابع مشابه
Constant-Round Authenticated Group Key Exchange for Dynamic Groups
An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptographic goals. In the paper, we study AGKE schemes for dynamically changing groups in ad hoc networks, i.e., for environments such that a member of a group may join and/or leave at any given time and a group key is exchanged with...
متن کاملAuthenticated Key Exchange Protocol in One-Round
The Key-exchange protocol is one of the most basic and widely used cryptographic protocols in internet for secure communication. In a two-party setting, cryptographic protocol design has often ignored the possibility of simultaneous message transmission by each of the two parties. Most protocols for two-party have been designed assuming that parties alternate sending their messages. We present ...
متن کاملOne-Round Password-Based Authenticated Key Exchange
We show a general framework for constructing password-based authenticated key exchangeprotocols with optimal round complexity — one message per party, sent simultaneously — inthe standard model, assuming the existence of a common reference string. When our frameworkis instantiated using bilinear-map cryptosystems, the resulting protocol is also (reasonably)efficient. Somewhat su...
متن کاملPartitioned Group Password-Based Authenticated Key Exchange
Group Password-Based Authenticated Key Exchange (GPAKE) allows a group of users to establish a secret key, as long as all of them share the same password. However, in existing GPAKE protocols as soon as one user runs the protocol with a non-matching password, all the others abort and no key is established. In this paper we seek for a more flexible, yet secure, GPAKE and put forward the notion o...
متن کاملProvably Authenticated Group Diie-hellman Key Exchange
Group Diie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to provide a pool of players with a shared secret key which may later be used, for example, to achieve multicast message integrity. Over the years, several schemes have been ooered. However, no formal treatment for this cryptographic problem has ever been suggested. In this paper, we present a security model for this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Intelligent Transportation Systems
سال: 2022
ISSN: ['1558-0016', '1524-9050']
DOI: https://doi.org/10.1109/tits.2022.3169182